#include <stdio.h>
#include "heap_sort.h"

int main()
{
    int arr[8] = {8, 2, 9, 1, 6, 9, 0, 4};
    int i = 0;
    tree_node_t *root = NULL;

    printf("输入原始序列\n");
    for(i = 0; i < 8; i++){
        printf("%d, ", arr[i]);
        heap_sort_insert_node(&root, arr[i]);
    }
    printf("\n");
    printf("最小堆输出\n");
    for(i = 0; i < 8; i++){
        printf("%d, ", heap_sort_get_node(&root));
    }
    printf("\n");

    return 0;
}
